Efficient blind adaptive Karhunen–Loéve transform via parallel search
نویسندگان
چکیده
منابع مشابه
Adaptive Parallel Iterative Deepening Search
Many of the artiicial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, the size of these spaces and the corresponding computational eeort reduce the applicability of otherwise novel and eeective algorithms. A number of parallel and distributed approaches to search have considerably improved the performance of the search process. Our goal is...
متن کاملEfficient Parallel Algorithms for Euclidean Distance Transform
The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its distance to the nearest foreground pixel. Two parallel algorithms for EDT on linear array with reconfigurable pipeline bus system (LARPBS) are presented. For an image with n × n pixels, the first algorithm can complete EDT in O [(log n log log n)/(log log log n)] time using n2 proce...
متن کاملParallel Greedy Randomized Adaptive Search Procedures
A GRASP (Greedy Randomized Adaptive Search Procedure) is a metaheuristic for producing good-quality solutions of combinatorial optimization problems. It is usually implemented with a construction procedure based on a greedy randomized algorithm followed by local search. In this Chapter, we survey parallel implementations of GRASP. We describe simple strategies to implement independent parallel ...
متن کاملA parallel adaptive tabu search approach
This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive parallelism was used to dynamically adjust the parallelism degree of the application with respect to the system load. Adaptive parallelism demonstrates that high-performance computing using a hundred of heterogeneous workstations combined with massively parallel machines is feasible to solve larg...
متن کاملAdaptive Parallel Search for Theorem Proving
Many of the artificial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, the size of these spaces and the corresponding computational effort reduce the applicability of otherwise novel and effective algorithms. Because automated theorem provers rely on heuristic search through the space of possible inferences, they are subject to the same di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2018
ISSN: 1550-1477,1550-1477
DOI: 10.1177/1550147718782371